翻訳と辞書 Words near each other ・ "O" Is for Outlaw ・ "O"-Jung.Ban.Hap. ・ "Ode-to-Napoleon" hexachord ・ "Oh Yeah!" Live ・ "Our Contemporary" regional art exhibition (Leningrad, 1975) ・ "P" Is for Peril ・ "Pimpernel" Smith ・ "Polish death camp" controversy ・ "Pro knigi" ("About books") ・ "Prosopa" Greek Television Awards ・ "Pussy Cats" Starring the Walkmen ・ "Q" Is for Quarry ・ "R" Is for Ricochet ・ "R" The King (2016 film) ・ "Rags" Ragland ・ ! (album) ・ ! (disambiguation) ・ !! ・ !!! ・ !!! (album) ・ !!Destroy-Oh-Boy!! ・ !Action Pact! ・ !Arriba! La Pachanga ・ !Hero ・ !Hero (album) ・ !Kung language ・ !Oka Tokat ・ !PAUS3 ・ !T.O.O.H.! ・ !Women Art Revolution Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク metrical task system ： ウィキペディア英語版 metrical task system Task systems are mathematical objects used to model the set of possible configuration of online algorithms. They were introduced by Borodin, Linial and Saks (1992) to model a variety of online problems. A task system determines a set of states and costs to change states. Task systems obtain as input a sequence of requests such that each request assigns processing times to the states. The objective of an online algorithm for task systems is to create a schedule that minimizes the overall cost incurred due to processing the tasks with respect to the states and due to the cost to change states. If the cost function to change states is a metric, the task system is a metrical task system (MTS). This is the most common type of task systems. Metrical task systems generalize online problems such as paging, list accessing, and the k-server problem (in finite spaces). ==Formal Definition== A task system is a pair $(S,d)$ where $S=\backslash$ is a set of states and $d:S\; \backslash times\; S\; \backslash rightarrow\; \backslash mathbb$ is a distance function. If $d$ is a metric, $(S,d)$ is a metrical task system. An input to the task system is a sequence $\backslash sigma\; =\; T\_1,T\_2,\backslash dotsc,T\_l$ such that for each $i$, $T\_i$ is a vector of $n$ non-negative entries that determine the processing costs for the $n$ states when processing the $i$th task. An algorithm for the task system produces a schedule $\backslash pi$ that determines the sequence of states. For instance, $\backslash pi(i)=s\_j$ means that the $i$th task $T\_i$ is run in state $s\_j$. The processing cost of a schedule is $\backslash mathrm(\backslash pi,\backslash sigma)\; =\; \backslash sum\_^l\; d(\backslash pi(i-1),\backslash pi(i))\; +\; T\_i(\backslash pi(i)).$ The objective of the algorithm is to find a schedule such that the cost is minimized. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「metrical task system」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.